Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array portion that correlates two parameters involved in data, such as ages and income for the amount of sales per some period. The previous subcubic time algorithm is simplified, and the time complexity is improved for the worst...
متن کاملEfficient Parallel Algorithms for the Maximum Subarray Problem
Parallel algorithm design is generally hard. Parallel program verification is even harder. We take an example from the maximum subarray problem and and show those two problems of design and verification. The best known communication steps for a mesh architecture for the maximum subarray problem is 2n − 1. We give a formal proof for the parallel algorithm on the mesh architecture based on Hoare ...
متن کاملImproved Algorithms for the K-Maximum Subarray Problem
Themaximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allowed, Bengtsson and Chen presented OðminfK + n logn‚ n ffiffiffiffi K p gÞ time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays...
متن کاملParallel Algorithms for Maximum Subsequence and Maximum Subarray
Given a sequence Q of n numbers positive and negative the maximum subsequence of Q is the contiguous subsequence that has the maximum sum among all contiguous subsequences of Q Given a two dimensional array A of n n numbers positive and negative the maximum subarray of A is the contiguous subarray that has the maximum sum among all contiguous subarrays of A We present two O log n time parallel ...
متن کاملImproved Algorithms for the K-Maximum Subarray Problem for Small K
The maximum subarray problem for a oneor two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to find the K subarrays with largest sums. We improve the time complexity for the one-dimensional case from O(min{K + n log n, n √ K}) for 0 ≤ K ≤ n(n − 1)/2 to O(n logK + K) for K ≤ n. The latter is better when K ≤ √n log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00313-5